General Variable Neighborhood Search for the Quote-Travelling Repairman Problem
نویسندگان
چکیده
منابع مشابه
The Complexity of the Travelling Repairman Problem
— In the travelling repairman problem (TRP) we are given a finite set of points and the travel times between any two ofthem, and wish to find the route through them which minimizes the sum of the delays for reaching each point. We consider the TRP when ail points are on the straight line, and give a polynomial-time algorithm for it. If we have deadlines (that is, bounds on the maximum delay for...
متن کاملGeneral variable neighborhood search for the continuous optimization
We suggest a new heuristic for solving unconstrained continuous optimization problems. It is based on a generalized version of the variable neighborhood search metaheuristic. Different neighborhoods and distributions, induced from different metrics are ranked and used to get random points in the shaking step. We also propose VNS for solving constrained optimization problems. The constraints are...
متن کاملA Development of Hybrid Cross Entropy-Tabu Search Algorithm for Travelling Repairman Problem
Travelling Repairman Problem (TRP) is one variant of the Travelling Salesman Problem (TSP) with the objective function minimizing the total waiting time for customers served by the repairman. Finding TRP solution is very important because it is often encountered in real world cases. In the TRP, a customer requires a fast service that he was satisfied. TRP is a combinatorial problem that require...
متن کامل„ Variable Neighborhood Search for the Static Aircraft Sequencing Problem
Ich erkläre an Eides statt, daß ich die vorliegende Arbeit selbständig und ohne fremde Hilfe verfasst, andere als die angegebenen Quellen nicht benützt und die den benutzten Quellen wörtlich oder inhaltlich entnommenen Stellen als solche kenntlich gemacht habe.
متن کاملA Variable Neighborhood Search for Solving the Linear Ordering Problem
A Systematic change of Neighborhood within a possibly randomized local search algorithm yields a simple and effective metaheuristic for combinatorial and global optimization. In this paper we present a Variable Neighborhood Search implementation designed to find high quality solutions for the NP-hard Linear Ordering Problem, which has a significant number of application in practice, such triang...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2020
ISSN: 2156-5570,2158-107X
DOI: 10.14569/ijacsa.2020.0110490